Spatial Query Processing Using Generalized Filter

نویسندگان

  • Xiaomei Zhou
  • Xuemin Lin
  • Chengfei Liu
  • Jiannong Cao
چکیده

This is the author's version of the work. It is posted here with the permission of the publisher for your personal use. No further distribution is permitted. If your library has a subscription to these conference proceedings, you may also be able to access the published version via the library catalogue. Spatial data, ranging from various land information data to diierent t ypes of environmental data, are typically collected and used by diierent custodians. Full beneets of using spatial data can be achieved by c o m bining the data from diierent sources covering a common region. Due to organizational, political and technical reasons, it is unreal-istic to physically integrate vast amount of spatial data managed by diierent systems in diierent organizations. A practical approach i s t o p r o vide interoperability t o s u p-port multi-site data queries. In this paper, we study the performance aspect of complex spatial query processing. We propose a framework for processing queries with multiple spatial and aspatial predicates using data from multiple sites. Using a new concept called generalized lter, a query is processed in three steps. First, an aspatial lter that incorporates some conditions derived from spatial predicates is used to nd a set of candidates, which is a superset of the nal query results. Then, the candidates are manipulated and a reenement step is executed following an optimized candidate sequence. Finally, a post-processing step is used to handle spatial expressions in query results. The focus of this paper is to generate enhanced lters in order to minimize the need of transferring and processing complex spatial data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial Query Optimization Utilizingearly Separated Filter and Refinement

| Due to the high complexity and large volume of spatial data, a spatial query has been processed in two steps, called the lter step and the reenement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of a...

متن کامل

Spatial Query Optimization Utilizing Early Separated Filter and Refinement Strategy

| Due to the high complexity and large volume of spatial data, a spatial query is usually processed in two steps, called the lter step and the re nement step. However, the two-step processing of the spatial query has been considered locally in one spatial predicate evaluation at the query execution level. This paper presents query optimization strategies which exploit the two-step processing of...

متن کامل

Early Separation of Filter and Refinement Steps in Spatial Query Optimization

The spatial query has been processed in two steps, the filter step and the refinement step, due to a large volume and high complexity of the spatial data. However, this approach has been considered only in the query execution phase after completing the query optimization phase. This paper presents query optimization strategies which take the characteristics of spatial databases into account. Th...

متن کامل

LocationSpark: A Distributed In-Memory Data Management System for Big Spatial Data

We present LocationSpark, a spatial data processing system built on top of Apache Spark, a widely used distributed data processing system. LocationSpark offers a rich set of spatial query operators, e.g., range search, kNN, spatio-textual operation, spatial-join, and kNN-join. To achieve high performance, LocationSpark employs various spatial indexes for in-memory data, and guarantees that immu...

متن کامل

Spatial Query Processing in Geographic Database Systems

In this pupcar, we propose U spaliul qwrv languagt., called GSQL, to hurdle complex spatial olvects such us points, lines, rectangles, or polygons. To implemcvtt the ypatiul operutors such JS nearest, furthest, intersect, CO ver, adjacent-to, end-at, and distance. we present U two-phase query processing technique ionwt ing of a filter phase urd a refinement phase. The filter phase i s h u e d o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Cooperative Inf. Syst.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2000